Planar Graphs have Independence Ratio at least 3/13
نویسندگان
چکیده
منابع مشابه
Planar Graphs have Independence Ratio at least 3/13
The 4 Color Theorem (4CT) implies that every n-vertex planar graph has an independent set of size at least n4 ; this is best possible, as shown by the disjoint union of many copies of K4. In 1968, Erdős asked whether this bound on independence number could be proved more easily than the full 4CT. In 1976 Albertson showed (independently of the 4CT) that every n-vertex planar graph has an indepen...
متن کاملTriangle-free planar graphs with minimum degree 3 have radius at least 3
We prove that every triangle-free planar graph with minimum degree 3 has radius at least 3; equivalently, no vertex neighborhood is a dominating set.
متن کاملOn 3-choosable planar graphs of girth at least 4
Let G be a plane graph of girth at least 4. Two cycles of G are intersecting if they have at least one vertex in common. In this paper, we show that if a plane graph G has neither intersecting 4-cycles nor a 5-cycle intersecting with any 4-cycle, then G is 3-choosable, which extends one of Thomassen’s results [C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B 64 (...
متن کاملOn the independence ratio of distance graphs
A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph G is the maximum density of an independent set in G. Lih, Liu, and Zhu [31] showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well stud...
متن کاملCycles in graphs with large independence ratio
where α(X) is the independence number of the subgraph of G induced by X. The independence ratio is a relaxation of the chromatic number χ(G) in the sense that χ(G) ≥ ι(G) for every graph G, while for many natural classes of graphs these quantities are almost equal. In this paper, we address two old conjectures of Erdős on cycles in graphs with large chromatic number and a conjecture of Erdős an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5309